Upper bounds for sorting integers on random access machines
نویسندگان
چکیده
منابع مشابه
Improved Upper and Lower Time Bounds for Parallel Random Access Machines Without Simultaneous Writes
e m The time required by a variant of the PRAM (a parallel machin odel which consists of sequential processors which communicate by t reading and writing into a common shared memory) to compute a cer ain class of functions called critical functions (which include the l c Boolean OR of n bits) is studied. Simultaneous reads from individua ells of the shared-memory are permitted, but simultaneous...
متن کاملMiltersen. Lower Bounds for Union-split--nd Related Problems on Random Access Machines. In
10 to instances with fewer don't cares. The hardest case seems to be when queries have exactly d 2 don't cares. In this case npm is extremely rich. Almost all entries in the communication matrix are one. However, perhaps not surprisingly, we have the following: 11 Claim 16. The communication matrix for npm restricted to queries with exactly d 2 don't cares contains a 1-monochromatic rectangle o...
متن کاملNeural Random-Access Machines
In this paper, we propose and investigate a new neural network architecture called Neural Random Access Machine. It can manipulate and dereference pointers to an external variable-size random-access memory. The model is trained from pure input-output examples using backpropagation. We evaluate the new model on a number of simple algorithmic tasks whose solutions require pointer manipulation and...
متن کاملSorting Integers on the AP1000
Sorting is one of the classic problems of computer science. Whilst well understood on sequential machines, the diversity of architectures amongst parallel systems means that algorithms do not perform uniformly on all platforms. This document describes the implementation of an radix based algorithm for sorting positive integers on a Fujitsu AP1000 Supercomputer, which was constructed as an entry...
متن کاملUpper bounds on wavepacket spreading for random Jacobi matrices
A method is presented for proving upper bounds on the moments of the position operator when the dynamics of quantum wavepackets is governed by a random (possibly correlated) Jacobi matrix. As an application, one obtains sharp upper bounds on the diffusion exponents for random polymer models, coinciding with the lower bounds obtained in a prior work. The second application is an elementary argum...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1983
ISSN: 0304-3975
DOI: 10.1016/0304-3975(83)90023-3